Bounds for the Spectral Radius of a Matrix

نویسنده

  • A. M. Pfeffer
چکیده

Let A = [an] be an n X n matrix with complex entries. We define p(A ) to be the spectral radius of A and | A | to be the matrix [| a,y |]. A. Brauer [1], W. Ledermann [2] and A. Ostrowski [4] have developed bounds for p(\ A |). Their results, coupled with the result of Perron and Frobenius [6] that p(A) ^ p(\ A |) give upper bounds for p( A ) which are not less than p(\ A | ). These bounds are restricted to matrices with nonzero entries and do not take into account the effect of the phases of the entries of A on p(A). In Section I of this paper we obtain a sequence of bounds for p( A ) in terms of p( | Ar | ) (r = 1, 2, • • • ) which are less than or equal to p( | A | ) and converge to p( A ). In this manner we are partially accounting for the effect on p(A) of the phases of the a,y. In Section II we derive bounds for p(A) in terms of the Frobenius norm of A. These bounds always lie in the field of values of A, are computationally well suited to complex matrices and 'can be used in conjunction with the techniques of Section I. The authors are indebted to Olga Taussky and Alston Householder for suggestions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

Bounds for the Co-PI index of a graph

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

متن کامل

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

متن کامل

The Sign-Real Spectral Radius for Real Tensors

In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.

متن کامل

A note on the bounds of Laplacian-energy-like-invariant

The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...

متن کامل

On Zagreb Energy and edge-Zagreb energy

In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010